Apply GPCA to Motion Segmentation
نویسندگان
چکیده
In this paper, we present a motion segmentation approach based on the subspace segmentation technique, the generalized PCA. By incorporating the cues from the neighborhood of intensity edges of images, motion segmentation is solved under an algebra framework. Our main contribution is to propose a post-processing procedure, which can detect the boundaries of motion layers and further determine the layer ordering. Test results on real imagery have confirmed the validity of our method.
منابع مشابه
Generalized Principal Component Analysis (GPCA): an Algebraic Geometric Approach to Subspace Clustering and Motion Segmentation by
Generalized Principal Component Analysis (GPCA): an Algebraic Geometric Approach to Subspace Clustering and Motion Segmentation
متن کاملRobust GPCA Algorithm with Applications in Video Segmentation Via Hybrid System Identification
In this paper, we introduce the robust recursive GPCA algorithm that can segment a set of data points into multiple unknown linear models with different dimensions in the presence of noise and outliers. The algorithm is designed based on a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). We apply the robust GPCA algorithm in a video segmentati...
متن کاملImproved Multistage Learning for Multibody Motion Segmentation
We present an improved version of the MSL method of Sugaya and Kanatani for multibody motion segmentation. We replace their initial segmentation based on heuristic clustering by an analytical computation based on GPCA, fitting two 2-D affine spaces in 3-D by the Taubin method. This initial segmentation alone can segment most of the motions in natural scenes fairly correctly, and the result is s...
متن کاملHybridization of Particle Swarm Optimization with Unsupervised Clustering Algorithms for Image Segmentation
Unsupervised fuzzy clustering algorithms are one of many approaches used in image segmentation. The Fuzzy C-means algorithm (FCM) and the Possibilistic C-means algorithm (PCA) have been widely used. There is also the generalized possibilistic algorithm (GPCA). GPCA was proposed recently and is a general form of the previous algorithms. These clustering algorithms can be trapped to the local opt...
متن کاملModelling Data Segmentation for Image Retrieval Systems
The analysis of a large amount of data with complex structures is a challenging task in engineering and scientific applications. The data segmentation task usually involves either probabilistic or statistical approaches, however, global minima disadvantage is still present in each mentioned approaches. A combination of these two approaches is based on subspace arrangements avoiding global minim...
متن کامل